Approximation Algorithms for Linear Fractional-Multiplicative Problems
نویسندگان
چکیده
In this paper we propose a Fully Polynomial Time Approximation Scheme (FPTAS) for a class of optimization problems where the feasible region is a polyhedral one and the objective function is the sum or product of linear ratio functions. The class includes the well known ones of Linear (Sum-of-Ratios) Fractional Programming and Multiplicative Programming.
منابع مشابه
Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems
We consider several implicit fractional packing problems and obtain faster implementations of approximation schemes based on multiplicative-weight updates. This leads to new algorithms with near-linear running times for some fundamental problems in combinatorial optimization. We highlight two concrete applications. The first is to find the maximum fractional packing of spanning trees in a capac...
متن کاملSolving Fractional Programming Problems based on Swarm Intelligence
This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to s...
متن کاملPrimal-Dual Combinatorial Algorithms
Linear program and its duality have long been ubiquitous tools for analyzing NP-hard problems and designing fast approximation algorithms. Plotkin et al proposed a primaldual combinatorial algorithm based on linear duality for fractional packing and covering, which achieves significant speedup on a wide range of problems including multicommodity flow. The key ideas there are: 1) design a primal...
متن کاملA Numerical Approach for Fractional Optimal Control Problems by Using Ritz Approximation
In this article, Ritz approximation have been employed to obtain the numerical solutions of a class of the fractional optimal control problems based on the Caputo fractional derivative. Using polynomial basis functions, we obtain a system of nonlinear algebraic equations. This nonlinear system of equation is solved and the coefficients of basis polynomial are derived. The convergence of the num...
متن کاملA fractional type of the Chebyshev polynomials for approximation of solution of linear fractional differential equations
In this paper we introduce a type of fractional-order polynomials based on the classical Chebyshev polynomials of the second kind (FCSs). Also we construct the operational matrix of fractional derivative of order $ gamma $ in the Caputo for FCSs and show that this matrix with the Tau method are utilized to reduce the solution of some fractional-order differential equations.
متن کامل